Graph Automorphisms of Semimodular Lattices
نویسنده
چکیده
This paper deals with the relations between graph automorphisms and direct factors of a semimodular lattice of locally finite length.
منابع مشابه
Slim Semimodular Lattices. I. A Visual Approach
A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim lattices are planar. Slim semimodular lattices play the main role in [3], where lattice theory is applied to a purely group theoretical problem. After exploring some easy properties of slim lattices and slim semimodular lattices, we give two visual structure theorems for slim semimodular lattices.
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملNotes on Planar Semimodular Lattices. VII. Resections of Planar Semimodular Lattices
A recent result of G. Czédli and E. T. Schmidt gives a construction of slim (planar) semimodular lattices from planar distributive lattices by adding elements, adding “forks”. We give a construction that accomplishes the same by deleting elements, by “resections”.
متن کاملSlim Semimodular Lattices. II. A Description by Patchwork Systems
Rectangular lattices are special planar semimodular lattices introduced by G. Grätzer and E. Knapp in 2009. By a patch lattice we mean a rectangular lattice whose weak corners are coatoms. As a sort of gluings, we introduce the concept of a patchwork system. We prove that every glued sum indecomposable planar semimodular lattice is a patchwork of its maximal patch lattice intervals “sewn togeth...
متن کاملSemimodular Lattices and Semibuildings
In a ranked lattice, we consider two maximal chains, or “flags” to be i-adjacent if they are equal except possibly on rank i . Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a “Jordan-Hölder permutation” between any two flags. This permutation has the properties of an Sn-distance function on the chamber system of flags. Using these noti...
متن کامل